An efficient measure of compactness for two-dimensional shapes and its application in regionalization problems

An Efficient Measure of Compactness for 2D Shapes and its Application in Regionalization Problems

A measure of shape compactness is a numerical quantity representing the degree to which a shape is compact. Ways to provide an accurate measure have been given great attention due to its application in a broad range of GIS problems, such as detecting clustering patterns from remote sensing images, understanding urban sprawl, and redrawing electoral districts to avoid gerrymandering. In this pap...

Compactness for Regionalization and its Application in Land-Use Planning

The Quasi-Normal Direction (QND) Method: An Efficient Method for Finding the Pareto Frontier in Multi-Objective Optimization Problems

In managerial and economic applications, there appear problems in which the goal is to simultaneously optimize several criteria functions (CFs). However, since the CFs are in conflict with each other in such cases, there is not a feasible point available at which all CFs could be optimized simultaneously. Thus, in such cases, a set of points, referred to as 'non-dominate' points (NDPs), will be...

Three Dimensional Localization of an Unknown Target Using Two Heterogeneous Sensors

Heterogeneous wireless sensor networks consist of some different types of sensor nodes deployed in a particular area. Different sensor types can measure different quantity of a source and using the combination of different measurement techniques, the minimum number of necessary sensors is reduced in localization problems. In this paper, we focus on the single source localization in a heterogene...

The p-Compact-regions Problem

The p-compact-regions problem involves the search for an aggregation of n atomic spatial units into p-compact, contiguous regions. This article reports our efforts in designing a heuristic framework—MERGE (memory-based randomized greedy and edge reassignment) —to solve this problem through phases of dealing, randomized greedy, and edge reassignment. This MERGE heuristic is able to memorize (ME ...